Density-Based Entropy Centrality for Community Detection in Complex Networks

One of the most important problems in complex networks is location nodes that are essential or play a main role network. Nodes with local roles centers real communities. Communities sets and densely connected internally. Choosing right as seeds communities crucial determining We propose new centrality measure named density-based entropy for identification nodes. It measures sum sizes maximal cliques to which each node its neighbor belong. The proposed explaining influence node, provides an efficient way locally identify community detection because structures. can be computed independently individual vertices, large networks, not well-specified networks. use seed selection outperforms other measures.